#include <iostream>
#include <algorithm>
#include <cstdio>
#include <array>
#include <tuple>
#define tupl tuple <int, int, int>
using namespace std;
#ifdef ONLINE_JUDGE

/* #define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++) */
/* char buf[1 << 23], *p1 = buf, *p2 = buf, ubuf[1 << 23], *u = ubuf; */

#endif
int read() {
    int p = 0, flg = 1;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') flg = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        p = p * 10 + c - '0';
        c = getchar();
    }
    return p * flg;
}
void write(int x) {
    if (x < 0) {
        x = -x;
        putchar('-');
    }
    if (x > 9) {
        write(x / 10);
    }
    putchar(x % 10 + '0');
}
bool _stmer;

const int N = 2e5 + 5;

array <tupl, N> qrl;
char strbuf[N];

bool _edmer;
int main() {
    cerr << (&_stmer - &_edmer) / 1024.0 / 1024.0 << "MB\n";
#ifndef cxqghzj
    freopen("copy.in", "r", stdin);
    freopen("copy.out", "w", stdout);
#endif
    int k = read(), m = read();
    scanf("%s", strbuf);
    string s = strbuf; s = " " + s;
    int n = read();
    for (int i = 1; i <= n; i++) {
        int l = read(), r = read(), x = read();
        qrl[i] = make_tuple(l, r, x);
    }
    for (int i = 1; i <= k; i++) {
        int res = i;
        for (int j = n; j >= 1; j--) {
            int l = 0, r = 0, x = 0; tie(l, r, x) = qrl[j];
            if (x >= res) continue;
            if (r - l >= res - x) res = res - x + l;
            else res -= (r - l);
        }
        putchar(s[res]);
    }
    puts("");
    return 0;
}
